Bicritical domination and duality coalescence of graphs

نویسندگان

  • Marcin Krzywkowski
  • Doost Ali Mojdeh
چکیده

A graph is bicritical if the removal of any pair of vertices decreases the domination number. We study properties of bicritical graphs and their relation with critical graphs. Next we obtain results for bicritical graphs with edge connectivity two or three. We also generalize the notion of the coalescence of two graphs, and we investigate the bicriticality of such graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bicritical total domination

A graph G with no isolated vertex is total domination bicritical if the removal of any pair of vertices, whose removal does not produce an isolated vertex, decreases the total domination number. In this paper we study properties of total domination bicritical graphs, and give several characterizations.

متن کامل

On the diameter of domination bicritical graphs

For a graph G, we let γ(G) denote the domination number of G. A graph G is said to be k-bicritical if γ(G) = k and γ(G − {x, y}) < k for any two vertices x, y ∈ V (G). Brigham et al. [Discrete Math. 305 (2005), 18–32] conjectured that the diameter of a connected k-bicritical graph is at most k − 1. However, in [Australas. J. Combin. 53 (2012), 53–65], counterexamples of the conjecture for k = 4...

متن کامل

Domination Criticality

For many graphs parameters, criticality is a fundamental issue. For domination number, Brigham, Chinn, and Dutton began the study of graphs where the domination number decreases on the removal of any vertex. Brigham, Haynes, Henning, and Rall defined the term (γ, k)-critical and proved results for graphs that are (γ, 2)-critical or bicritical. A graph G is said to be (γ, k)-critical if γ(G − S)...

متن کامل

Matching properties in connected domination critical graphs

A dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let c(G) denote the size of any smallest connected dominating set in G. A graph G is k-connected-critical if c(G)= k, but if any edge e ∈ E(Ḡ) is added to G, then c(G+ e) k − 1. This is a variation on the earlier concept of criticality of edge addition with respect to ordinary domination where a graph G ...

متن کامل

Factor-critical property in 3-dominating-critical graphs

Let γ(G) be the domination number of a graph G. A graph G is domination-vertex-critical, or γ-vertex-critical, if γ(G− v) < γ(G) for every vertex v ∈ V (G). In this paper, we show that: Let G be a γ-vertex-critical graph and γ(G) = 3. (1) If G is of even order and K1,6-free, then G has a perfect matching; (2) If G is of odd order and K1,7-free, then G has a near perfect matching with only three...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014